(3, 6) GWhD(v)-existence results

نویسندگان

  • R. Julian R. Abel
  • Norman J. Finizio
  • Malcolm Greig
چکیده

Necessary conditions for the existence of (3; 6) generalized Whist tournament designs on v players are that v ≡ 0; 1 (mod 6). For v= 6n+ 1 it is shown that these designs exist for all n. For v = 6n, it is impossible to have a design for n = 1, but for n¿ 1 it is shown that designs exist, except possibly for 73 values of n the largest of which is n = 199. A solution is also provided for the only unknown (v; 6; 5) RBIBD, namely, v = 174. c © 2002 Elsevier Science B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructions of optimal quaternary constant weight codes via group divisible designs

Generalized Steiner systems GS(2, k, v, g) were first introduced by Etzion and used to construct optimal constant weight codes over an alphabet of size g + 1 with minimum Hamming distance 2k − 3, in which each codeword has length v and weight k. As to the existence of a GS(2, k, v, g), a lot of work has been done for k = 3, while not so much is known for k = 4. The notion k-GDD was first introd...

متن کامل

Existence of resolvable H-designs with group sizes 2, 3, 4 and 6

In 1987, Hartman showed that the necessary condition v ≡ 4 or 8 (mod 12) for the existence of a resolvable SQS(v) is also sufficient for all values of v, with 23 possible exceptions. These last 23 undecided orders were removed by Ji and Zhu in 2005 by introducing the concept of resolvable H-designs. In this paper, we first develop a simple but powerful construction for resolvable H-designs, i.e...

متن کامل

On the possible volume of $mu$-$(v,k,t)$ trades

‎A $mu$-way $(v,k,t)$ $trade$ of volume $m$ consists of $mu$‎ ‎disjoint collections $T_1$‎, ‎$T_2‎, ‎dots T_{mu}$‎, ‎each of $m$‎ ‎blocks‎, ‎such that for every $t$-subset of $v$-set $V$ the number of‎ ‎blocks containing this t-subset is the same in each $T_i (1leq‎ ‎i leq mu)$‎. ‎In other words any pair of collections ${T_i,T_j}$‎, ‎$1leq i< j leq mu‎$ is a $(v,k,t)$ trade of volume $m$. In th...

متن کامل

The existence of ( v , 6 , λ ) - perfect Mendelsohn designs with λ > 1

The basic necessary conditions for the existence of a (v, k, λ)-perfect Mendelsohn design (briefly (v, k, λ)-PMD) are v ≥ k and λv(v− 1) ≡ 0 (mod k). These conditions are known to be sufficient in most cases, but certainly not in all. For k = 3, 4, 5, 7, very extensive investigations of (v, k, λ)-PMDs have resulted in some fairly conclusive results. However, for k = 6 the results have been far ...

متن کامل

Existence of six incomplete MOLS

Six mutually orthogonal Latin squares of order v (briefly 6 MOLS(v» missing a subdesign of 6 MOLS(n) are denoted by 6 IMOLS(v, n). The necessary condition for their existence is v ;;::: 7n. For small v and n where 1 v 1000 and 0 :::; n :::; 50, the existence has been investigated by Col bourn and Dinitz, who give a table of possible exceptions in the CRC Handbook of Combinatorial In this paper,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 261  شماره 

صفحات  -

تاریخ انتشار 2003